runtime.evacDst.b (field)

33 uses

	runtime (current package)
		map.go#L1163: 	b *bmap          // current destination bucket
		map.go#L1179: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.BucketSize)))
		map.go#L1180: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map.go#L1187: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.BucketSize)))
		map.go#L1188: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map.go#L1242: 					dst.b = h.newoverflow(t, dst.b)
		map.go#L1244: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map.go#L1247: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_fast32.go#L384: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.BucketSize)))
		map_fast32.go#L385: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map_fast32.go#L392: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.BucketSize)))
		map_fast32.go#L393: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map_fast32.go#L423: 					dst.b = h.newoverflow(t, dst.b)
		map_fast32.go#L425: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map_fast32.go#L428: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_fast64.go#L386: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.BucketSize)))
		map_fast64.go#L387: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map_fast64.go#L394: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.BucketSize)))
		map_fast64.go#L395: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map_fast64.go#L425: 					dst.b = h.newoverflow(t, dst.b)
		map_fast64.go#L427: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map_fast64.go#L430: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_faststr.go#L412: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.BucketSize)))
		map_faststr.go#L413: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map_faststr.go#L420: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.BucketSize)))
		map_faststr.go#L421: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map_faststr.go#L451: 					dst.b = h.newoverflow(t, dst.b)
		map_faststr.go#L453: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map_faststr.go#L456: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check